Robot Time Optimal Trajectory Planning Based on Improved Simplified Particle Swarm Optimization Algorithm

نویسندگان

چکیده

In order to tackle the robot trajectory planning problem with short running time as optimization goal, a time-optimal algorithm was presented based on improved simplified particle swarm (ISPSO). The robot’s constructed by 3-5-3 polynomial interpolation in joint space of robot. Under condition satisfying velocity constraint, objective function sum intervals between each node. ISPSO used optimize function. optimizing inertia weight updating method and introducing golden sine segmentation an operator. Compared other algorithms, had higher search accuracy. effectiveness proposed demonstrated through simulations using PUMA 560 industrial robot, which resulted 19% reduction compared algorithm. simulation results show that achieved under proved its superiority planning.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robot Path Planning Based on Random Coding Particle Swarm Optimization

Mobile robot navigation is to find an optimal path to guide the movement of the robot, so path planning is guaranteed to find a feasible optimal path. However, the path planning problem must be solve two problems, i.e., the path must be kept away from obstacles or avoid the collision with obstacles and the length of path should be minimized. In this paper, a path planning algorithm based on ran...

متن کامل

An Improved Particle Swarm Optimization Algorithm based on Membrane Structure

Presented a new hybrid particle swarm algorithm based on P systems, through analyzing the working principle and improved strategy of the elementary particle swarm algorithm. Used the particles algorithm combined with the membrane to form a community, particles use wheel-type structure to communicate the current best particle within the community. The best particles, as Representative, compete f...

متن کامل

Storage planning of automated pharmacy based on an improved adaptive chaotic particle swarm optimization algorithm

With the target of achieving dense storage of packed medicine of rapid dispensing system in automated pharmacy, an improved adaptive chaotic particle swarm optimization (IACPSO) algorithm was proposed to solve the storage planning problem. According to the proposed IACPSO algorithm, the diversity of the particle swarm was enhanced by using the ergodicity of the chaos motion to initialize the sw...

متن کامل

An Improved Particle Swarm Optimization Algorithm based on Adaptive Genetic Strategy for Global Numerical Optimal

Particle swarm optimization, which has attracted a great deal of attention as a global optimization method in recent years, has the drawback that continuous search based on the excellent dynamic characteristics cannot perform well with higher dimension of particles, especially in real world problems. On the contrary, the strong ability of selection, crossover, and mutation in genetic strategies...

متن کامل

Optimization Planning based on Improved Ant Colony Algorithm for Robot

As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result sho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3272835